The firefighter problem with more than one firefighter on trees
نویسندگان
چکیده
منابع مشابه
The firefighter problem with more than one firefighter on trees
In this paper we study the complexity of the firefighter problem and related problems on trees when more than one firefighter is available at each time step, and answer several open questions of [8]. More precisely, when b ≥ 2 firefighters are allowed at each time step, the problem is NP-complete for trees of maximum degree b+2 and polynomial-time solvable for trees of maximum degree b + 2 when...
متن کاملThe Stochastic Firefighter Problem
The dynamics of infectious diseases spread is crucial in determining their risk and offering ways to contain them. We study sequential vaccination of individuals in networks. In the original (deterministic) version of the Firefighter problem, a fire breaks out at some node of a given graph. At each time step, b nodes can be protected by a firefighter and then the fire spreads to all unprotected...
متن کاملThe Firefighter Problem: A Structural Analysis
We consider the complexity of the firefighter problem where a budget of b ≥ 1 firefighters are available at each time step. This problem is proved to be NP-complete even on trees of degree at most three and b = 1 [10] and on trees of bounded degree b+3 for any fixed b ≥ 2 [3]. In this paper, we provide further insight into the complexity landscape of the problem by showing a complexity dichotom...
متن کاملParameterized Complexity of the Firefighter Problem
In this paper we study the parameterized complexity of the firefighter problem. More precisely, we show that Saving k-Vertices and its dual Saving All But k-Vertices are both W[1]-hard for parameter k even for bipartite graphs. We also investigate several cases for which the firefighter problem is tractable. For instance, Saving kVertices is fixed-parameter tractable on planar graphs for parame...
متن کاملThe firefighter problem for cubic graphs
We show that the firefighter problem is NP-complete for cubic graphs. We also show that given a rooted tree of maximum degree three in which every leaf is the same distance from the root, it is NPcomplete to decide whether or not there is a strategy that protects every leaf from the fire, which starts at the root. By contrast, we describe a polynomial time algorithm to decide if it is possible ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.11.011